Realignment in the National Football League: Did they do it right?

The National Football League (NFL) in the United States expanded to 32 teams in 2002 with the addition of a team in Houston. At that point, the league was realigned into eight divisions, each containing four teams. We describe a branch‐and‐cut algorithm for minimizing the sum of intradivisional travel distances. We consider first the case where any team can be assigned to any division. We also consider imposing restrictions, such as aligning the AFC (American Football Conference) and the NFC (National Football Conference) separately or maintaining traditional rivalries. We show that the alignment chosen by the NFL does not minimize the sum of intradivisional travel distances, but that it is close to optimal for an alignment that aligns the NFC and AFC separately and imposes some additional restrictions. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 683–701, 2003.     

可转换债券的复合期权定价模型

可转换债券是一种内含期权结构的特殊金融产品。可转换债券的内含期权是一种奇异期权——复合期权。本文通过分别对无期权债券和复合期权的定价，获得了可转换债券在风险中性条件下的定价模型。     

传感器网络中基于LQI均值的功率控制方法

邻近图的功率控制方法是传感器网络拓扑控制中的一个重要研究方向。对比分析了PRR，RSSI和LQI等几种链路质量衡量指标的优劣，将LQI均值作为邻近图中邻节点的距离度量，构造链路质量邻近图LQPG，并对所构造的链路质量邻近图进行了仿真实验。结果表明，LQPG有着较低的平均节点度，在链路变化情况下，网络有着较低的平均功率，从而有效地延长了网络的生存期。     

Dissolution of an Empire: Insights from the İstanbul Bourse and the Ottoman War Bond

During the transformation period of the Ottoman Empire leading to the Republic of Turkey, many conflicts took place between 1918 and 1923. These conflicts interrupted the servicing of the Ottoman war bond. The reimbursement likelihood of this bond was related to the outcomes of First World War and the hostilities. This paper analyses the impacts of First World War and hostilities on the risk assessments regarding the Ottoman war debt, using manually collected data on the price of the Ottoman war bond traded at the ?stanbul bourse between 1918 and 1925. The empirical results imply that the defeat of the Bulgarian army and the peace offer of Austria-Hungary were associated with the increasing premium demanded by investors of the bond. The victories of the Turkish National Movement and the peace offer of the Allies to end the hostilities by 1922 positively affected the likelihood of the servicing of the debt.     

融合图嵌入的Smooth-PCANet图像识别算法

主成分分析网络（Principal Component Analysis Network,PCANet）是一种简单的深度学习算法,在图像识别领域具有优秀的性能。然而PCANet在构建网络卷积核时只关注了图像的主分量信息,忽视了近邻像素点之间的位置关系。而通常情况下,图像的相邻像素点具有空间强相关性,因此利用图结构保持像素点的位置近邻关系更有利于网络提取有效特征。因此,我们将图嵌入思想融入PCANet,提出一种新的图像识别算法Smooth-PCANet。为了验证Smooth-PCANet算法的有效性,我们在人脸、手写体字符以及图片等不同数据集上构建实验,并将Smooth-PCANet与多种基于深度学习的图像识别算法作了对比。实验结果证明,Smooth-PCANet算法比PCANet获得了更高的识别性能,并且更有效地避免了过拟合,在小样本训练时具有显著优势。     

Modeling of unsupervised knowledge graph of events based on mutual information among neighbor domains and sparse representation

Text event mining, as an indispensable method of text mining processing, has attracted the extensive attention of researchers. A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper, i.e. UKGE-MS. Specifically, UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information, and solves the problems of traditional unsupervised feature selection methods, which only focus on selecting features from a global perspective and ignoring the impact of local connection of samples. Firstly, considering the influence of local information of samples in feature correlation evaluation, a feature clustering algorithm based on average neighborhood mutual information is proposed, and the feature clusters with certain event correlation are obtained; Secondly, an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation, so as to enhance the generalization ability of the selected feature items. Finally, the events knowledge graph is constructed by means of sparse representation and l₁ norm. Extensive experiments are carried out on five real datasets and synthetic datasets, and the UKGE-MS are compared with five corresponding algorithms. The experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection, and has some advantages over other methods in text event recognition and discovery.     

Synchronization in hub terminals with the circular arrangement problem

Hub terminals are important entities in modern distribution networks and exist for any transportation device, that is, cross docks and parcel distribution centers for trucks, container ports for ships, railway yards for trains, and hub airports for aircraft. In any of these hubs, the mid‐term planning task of synchronizing the transshipment of goods and passengers when servicing the transportation devices has to be solved, for which many different solution approaches specifically tailored to the respective application exist. We, however, take a unified view on synchronization in hubs and aim at a general building block. As a point of origin, a basic vertex ordering problem, the circular arrangement problem (CAP), is identified. We explain the relation between the CAP and hub processes, develop suited algorithms for solving the CAP, and extend the basic CAP by multiple additions, for example, arrival times, limited storage space, and multiple service points, make the problem adaptable to a wide range of hub terminals. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 454–469, 2015     

基于时间序无圈有向图的多准则优化成像调度

合理有效地利用遥感卫星资源获取更多高质量影像数据是卫星成像调度的重要工作。提出了一种新的成像调度解决方案。应用图论相关理论,建立卫星成像时间序无圈有向图模型,利用多项准则作为衡量标准对不同成像路径进行评价,提出时间序多准则最短路径算法求取优化成像路径。理论分析和实验表明,该解决方案可以在较短时间内获得多条pareto优化成像路径,具有良好的调度性能。     

Graph distance‐dependent labeling related to code assignment in computer networks

For nonnegative integers d₁, d₂, and L(d₁, d₂)‐labeling of a graph G, is a function f : V(G) → {0, 1, 2, …} such that |f(u) − f(v)| ≥ d_i whenever the distance between u and v is i in G, for i = 1, 2. The L(d₁, d₂)‐number of G, λ(G) is the smallest k such that there exists an L(d₁, d₂)‐labeling with the largest label k. These labelings have an application to a computer code assignment problem. The task is to assign integer “control codes” to a network of computer stations with distance restrictions, which allow d₁ ≤ d₂. In this article, we will study the labelings with (d₁, d₂) ∈ {(0, 1), (1, 1), (1, 2)}. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于状态变换的同步时序电路测试生成

详细分析了固定故障所反映出的状态变换特征,提出状态变换故障模型以及相对应的测试生成压缩方法;基于无复位时序电路,深入研究了有复位状态的同步状态机测试生成方法的扩展问题;最后讨论了故障精简以及启发知识在测试生成中的应用问题。